منابع مشابه
Cooperative Set Function Optimization Without Communication or Coordination
We introduce a new model for cooperative agents that seek to optimize a common goal without communication or coordination. Given a universe of elements V, a set of agents, and a set function f , we ask each agent i to select a subset Si ⊂ V such that the size of Si is constrained (i.e., |Si| < k). The goal is for the agents to cooperatively choose the sets Si to maximize the function evaluated ...
متن کاملA New Continuous Action-Set Learning Automaton for Function Optimization
In this paper, we study an adaptive random search method based on continuous action-set learning automaton for solving stochastic optimization problems in which only the noisecorrupted value of function at any chosen point in the parameter space is available. We first introduce a new continuous action-set learning automaton (CALA) and study its convergence properties. Then we give an algorithm ...
متن کاملAnswer Set Optimization
We investigate the combination of answer set programming and qualitative optimization techniques. Answer set optimization programs (ASO programs) have two parts. The generating program produces answer sets representing possible solutions. The preference program expresses user preferences. It induces a preference relation on the answer sets of based on the degree to which rules are satisfied. We...
متن کاملA BINARY LEVEL SET METHOD FOR STRUCTURAL TOPOLOGY OPTIMIZATION
This paper proposes an effective algorithm based on the level set method (LSM) to solve shape and topology optimization problems. Since the conventional LSM has several limitations, a binary level set method (BLSM) is used instead. In the BLSM, the level set function can only take 1 and -1 values at convergence. Thus, it is related to phase-field methods. We don’t need to solve the Hamilton-Jac...
متن کاملSet Branching in Constraint Optimization
Branch and bound is an effective technique for solving constraint optimization problems (COP’s). However, its search space expands very rapidly as the domain sizes of the problem variables grow. In this paper, we present an algorithm that clusters the values of a variable’s domain into sets. Branch and bound can then branch on these sets of values rather than on individual values, thereby reduc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of China
سال: 2018
ISSN: 2194-668X,2194-6698
DOI: 10.1007/s40305-018-0233-3